全文获取类型
收费全文 | 5955篇 |
免费 | 623篇 |
国内免费 | 567篇 |
专业分类
电工技术 | 437篇 |
综合类 | 565篇 |
化学工业 | 166篇 |
金属工艺 | 60篇 |
机械仪表 | 248篇 |
建筑科学 | 312篇 |
矿业工程 | 81篇 |
能源动力 | 142篇 |
轻工业 | 40篇 |
水利工程 | 230篇 |
石油天然气 | 151篇 |
武器工业 | 71篇 |
无线电 | 622篇 |
一般工业技术 | 361篇 |
冶金工业 | 74篇 |
原子能技术 | 40篇 |
自动化技术 | 3545篇 |
出版年
2024年 | 6篇 |
2023年 | 69篇 |
2022年 | 66篇 |
2021年 | 96篇 |
2020年 | 100篇 |
2019年 | 145篇 |
2018年 | 98篇 |
2017年 | 177篇 |
2016年 | 172篇 |
2015年 | 227篇 |
2014年 | 300篇 |
2013年 | 359篇 |
2012年 | 330篇 |
2011年 | 446篇 |
2010年 | 340篇 |
2009年 | 425篇 |
2008年 | 458篇 |
2007年 | 521篇 |
2006年 | 415篇 |
2005年 | 369篇 |
2004年 | 295篇 |
2003年 | 265篇 |
2002年 | 229篇 |
2001年 | 161篇 |
2000年 | 150篇 |
1999年 | 136篇 |
1998年 | 118篇 |
1997年 | 124篇 |
1996年 | 102篇 |
1995年 | 71篇 |
1994年 | 90篇 |
1993年 | 60篇 |
1992年 | 40篇 |
1991年 | 43篇 |
1990年 | 18篇 |
1989年 | 24篇 |
1988年 | 19篇 |
1987年 | 13篇 |
1986年 | 4篇 |
1985年 | 11篇 |
1984年 | 8篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 7篇 |
1980年 | 5篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1974年 | 3篇 |
1962年 | 2篇 |
排序方式: 共有7145条查询结果,搜索用时 15 毫秒
71.
In this paper, we present an algorithm for the systematic calculation of Lie point symmetries for fractional order differential equations (FDEs) using the method as described by Buckwar & Luchko (1998) and Gazizov, Kasatkin & Lukashchuk (2007, 2009, 2011). The method has been generalised here to allow for the determination of symmetries for FDEs with n independent variables and for systems of partial FDEs. The algorithm has been implemented in the new MAPLE package FracSym (Jefferson and Carminati 2013) which uses routines from the MAPLE symmetry packages DESOLVII (Vu, Jefferson and Carminati, 2012) and ASP (Jefferson and Carminati, 2013). We introduce FracSym by investigating the symmetries of a number of FDEs; specific forms of any arbitrary functions, which may extend the symmetry algebras, are also determined. For each of the FDEs discussed, selected invariant solutions are then presented. 相似文献
72.
《Expert systems with applications》2014,41(9):4475-4493
Hyper-heuristics are emerging methodologies that perform a search over the space of heuristics in an attempt to solve difficult computational optimization problems. We present a learning selection choice function based hyper-heuristic to solve multi-objective optimization problems. This high level approach controls and combines the strengths of three well-known multi-objective evolutionary algorithms (i.e. NSGAII, SPEA2 and MOGA), utilizing them as the low level heuristics. The performance of the proposed learning hyper-heuristic is investigated on the Walking Fish Group test suite which is a common benchmark for multi-objective optimization. Additionally, the proposed hyper-heuristic is applied to the vehicle crashworthiness design problem as a real-world multi-objective problem. The experimental results demonstrate the effectiveness of the hyper-heuristic approach when compared to the performance of each low level heuristic run on its own, as well as being compared to other approaches including an adaptive multi-method search, namely AMALGAM. 相似文献
73.
进行了CO2泡沫压裂液的室内配制、流变性测定以及摩阻计算方法研究。室内实验中观测了CO2泡沫压裂液的形成、动态变化、泡沫结构,测定了CO2泡沫压裂液的流变性,发现其属于假塑性非牛顿流体。推导了CO2泡沫压裂液在油管内流动的摩阻计算公式,计算了不同管径、不同排量、不同泡沫质量时的摩阻曲线,进行了井筒内CO2泡沫压裂液摩阻压降实测,与计算方法相比误差在工程应用允许范围内。该研究所得到的CO2泡沫压裂液流动特性、摩阻压降计算方法、经验图版等,可供工程应用中参考。 相似文献
74.
《Expert systems with applications》2014,41(14):6274-6290
This paper revisits the classical Polynomial Mutation (PLM) operator and proposes a new probe guided version of the PLM operator designed to be used in conjunction with Multiobjective Evolutionary Algorithms (MOEAs). The proposed Probe Guided Mutation (PGM) operator is validated by using data sets from six different stock markets. The performance of the proposed PGM operator is assessed in comparison with the one of the classical PLM with the assistance of the Non-dominated Sorting Genetic Algorithm II (NSGAII) and the Strength Pareto Evolutionary Algorithm 2 (SPEA2). The evaluation of the performance is based on three performance metrics, namely Hypervolume, Spread and Epsilon indicator. The experimental results reveal that the proposed PGM operator outperforms with confidence the performance of the classical PLM operator for all performance metrics when applied to the solution of the cardinality constrained portfolio optimization problem (CCPOP). We also calculate the True Efficient Frontier (TEF) of the CCPOP by formulating the CCPOP as a Mixed Integer Quadratic Program (MIQP) and we compare the relevant results with the approximate efficient frontiers that are generated by the proposed PGM operator. The results confirm that the PGM operator generates near optimal solutions that lie very close or in certain cases overlap with the TEF. 相似文献
75.
76.
77.
Abstract. A symbolic method which can be used to obtain the asymptotic bias and variance coefficients to order O(1/n) for estimators in stationary time series is discussed. Using this method, the large‐sample bias of the Burg estimator in the AR(p) for p = 1, 2, 3 is shown to be equal to that of the least squares estimators in both the known and unknown mean cases. Previous researchers have only been able to obtain simulation results for the Burg estimator's bias because this problem is too intractable without using computer algebra. The asymptotic bias coefficient to O(1/n) of Yule–Walker as well as least squares estimates is also derived in AR(3) models. Our asymptotic results show that for the AR(3), just as in the AR(2), the Yule–Walker estimates have a large bias when the parameters are near the nonstationary boundary. The least squares and Burg estimates are much better in this situation. Simulation results confirm our findings. 相似文献
78.
79.
An essential problem in the design of holographic algorithms is to decide whether the required signatures can be realized under a suitable basis transformation (SRP). For holographic algorithms with matchgates on domain size 2, , , and have built a systematical theory. In this paper, we reduce SRP on domain size k≥3 to SRP on domain size 2 for holographic algorithms with matchgates on bases of rank 2. Furthermore, we generalize the collapse theorem of [3] to domain size k≥3. 相似文献
80.
We study asynchronously communicating open systems modeled as Petri nets with an interface. An accordance preorder describes when one open system can be safely replaced by another open system without affecting some behavioral property of the overall system. Although accordance is decidable for several behavioral properties if we assume a previously known bound on the maximal number of pending messages, we show that it is not decidable without this assumption. 相似文献